Improved Model of Scheduling Algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Quantum Scheduling Algorithm

The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by N . Classically, it needs at least O( N log2 N) bits of communication to find the common 1. The best known quantum algorithm would require O( √ N log2 N) qubits of communication. This paper gives a quantum algorithm to find the common 1 with onl...

متن کامل

An Improved CPU Scheduling Algorithm

In multiprogramming systems i.e. in systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be e...

متن کامل

Improved Max-Min Scheduling Algorithm

In this research paper, additional constrains have been considered to progress a holistic analysis based algorithm based on Max-Min algorithm, which work on principle of sorting jobs(cloudlets) based on completion time of cloudlets. The improved algorithms here also reviews the job characteristics in method of size, pattern, payload ratio and available storage blocks in particular cluster of co...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

An Improved Memetic Algorithm for Break Scheduling

In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requiremen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems of Computer Science

سال: 2018

ISSN: 2579-2784

DOI: 10.51408/1963-0027